Reordering Ruppert’s Algorithm
نویسنده
چکیده
Ruppert’s algorithm [6] is an elegant method for generating size-competitive meshes, but admits a poor worst case run-time. Recent time-efficient Delaunay refinement algorithms [2] rely on bounding the the degree of each intermediate triangulation and thus ensure that all local operations in the Delaunay triangulation are efficient. We propose a simple alternative to Ruppert’s algorithm which maintains this additional property that the all intermediate triangulations have bounded degree.
منابع مشابه
On the Termination of Ruppert’s Algorithm
For a non-acute planar straight-line graph, Ruppert’s algorithm produces a conforming Delaunay triangulation composed of triangles containing no angles less than α. Ruppert proved the algorithm terminates for all α / 20.7◦ [5], but this constraint has been seen to be overly conservative in practice. Ruppert observed that the minimum angle reaches 30◦ during typical runs of the algorithm. Furthe...
متن کاملA Quadratic Running Time Example for Ruppert’s Refinement Algorithm
We present an example where Ruppert’s refinement algorithm for quality 2D Delaunay mesh generation runs in time quadratic in the size of the output mesh. For any n > 1, input and output mesh sizes of our example are Θ(n), the bounding box dimensions are 1×Θ(n), and the algorithm running time is Θ(n). Because Θ(n) is a theoretical upper bound on the running time of Ruppert’s refinement algorithm...
متن کاملWhen and Why Ruppert's Algorithm Works
An “adaptive” variant of Ruppert’s Algorithm for producing quality triangular planar meshes is introduced. The algorithm terminates for arbitrary Planar Straight Line Graph (PSLG) input. The algorithm outputs a Delaunay mesh where no triangle has minimum angle smaller than 26.45◦ except “across” from small angles of the input. No angle of the output mesh is smaller than arctan [(sin θ∗)/(2 − co...
متن کاملWhere and How Chew's Second Delaunay Refinement Algorithm Works
Chew’s second Delaunay refinement algorithm with offcenter Steiner vertices leads to practical improvement over Ruppert’s algorithm for quality mesh generation, but the most thorough theoretical analysis is known only for Ruppert’s algorithm. A detailed analysis of Chew’s second Delaunay refinement algorithm with offcenters is given, improving the guarantee of well-graded output for any minimum...
متن کاملOn the Non-Termination of Ruppert's Algorithm
A planar straight-line graph which causes the non-termination Ruppert’s algorithm for a minimum angle threshold α ' 29.5 is given. The minimum input angle of this example is about 74.5 meaning that failure is not due to small input angles. Additionally, a similar non-acute input is given for which Chew’s second algorithm does not terminate for a minimum angle threshold α ' 30.7. For a non-acute...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008